Characterization, parity, and power sequences of locally finite doubly stochastic matrices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Doubly stochastic matrices of trees

In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices I...

متن کامل

Random doubly stochastic tridiagonal matrices

Let Tn be the compact convex set of tridiagonal doubly stochastic matrices. These arise naturally in probability problems as birth and death chains with a uniform stationary distribution. We study ‘typical’ matrices T ∈ Tn chosen uniformly at random in the set Tn. A simple algorithm is presented to allow direct sampling from the uniform distribution on Tn. Using this algorithm, the elements abo...

متن کامل

Vertex degrees and doubly stochastic graph matrices

In this article, the relationship between vertex degrees and entries of the doubly stochastic graph matrix has been investigated. In particular, we present an upper bound for the main diagonal entries of a doubly stochastic graphmatrix and investigate the relations between a kind of distance for graph vertices and the vertex degrees. These results are used to answer in negative Merris’ question...

متن کامل

Generalized Doubly Stochastic Matrices and Linear Preservers

A real or complex n × n matrix is generalized doubly stochastic if all of its row sums and column sums equal one. Denote by V the linear space spanned by such matrices. We study the reducibility of V under the group Γ of linear operators of the form A 7→ PAQ, where P and Q are n×n permutation matrices. Using this result, we show that every linear operator φ : V → V mapping the set of generalize...

متن کامل

Asymptotic Nearness of Stochastic and Doubly-Stochastic Matrices

We prove that the set of n×n positive (row-)stochastic matrices and the corresponding set of doubly-stochastic matrices are asymptotically close. More specifically, random matrices within each of these classes are arbitrarily close in sufficiently high dimensions. AMS 2000 subject classifications:Primary 15A51,15A52,15A60, Stochastic Matrices. Let Sn denote the set of n × n stochastic matrices ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2009

ISSN: 0012-365X

DOI: 10.1016/j.disc.2009.07.005